Weakened Negative Introspection
نویسنده
چکیده
A new weakened scheme for negative introspection in autoepistemic reasoning is proposed. The scheme is formulated proof-theoretically in terms of enumer-ations of formulae. The resulting sets of conclusions based on this negative introspec-tion principle, cautious autoepistemic expansions, generalize Moore style stable expansions such that every set of premises has a cautious expansion. A nitary characterization is developed for cautious expansions. The elimination of weakly grounded cautious expansions yields a subclass of cautious expansions: the N-grounded cautious expansions. The least N-grounded cautious expansion is shown to be unique and the intersection of all N-grounded cautious expansions. This is in contrast with Moore style stable expansions. The least N-grounded cautious expansion can be constructed iteratively as the least xed point of a monotonic operator. Such a construction is exceptional, since autoepistemic expansions are nonconstructive in general. It is also shown that cautious autoepistemic logic is decidable. A comparison is made with some other schemes of weakened negative introspection. The given set of examples demonstrates that the proposed negative introspection principle is stronger than, e.g., that of the well-founded semantics.
منابع مشابه
A Scheme for Weakened Negative Introspection in Autoepistemic Reasoning
A novel scheme for weakened negative introspection in au-toepistemic reasoning is proposed. The scheme is formulated proof-theoretically in terms of enumerations of formulae. The resulting sets of conclusions , cautious expansions, are a generalization of Moore style stable expansions such that each set of premises has a cautious expansion. A nitary characterization is provided for the cautious...
متن کاملDecidability for some justification logics with negative introspection
Justification logics are modal logics that include justifications for the agent’s knowledge. So far, there are no decidability results available for justification logics with negative introspection. In this paper, we develop a novel model construction for such logics and show that justification logics with negative introspection are decidable for finite constant specifications. §
متن کاملAutoepistemic Logics of Closed Beliefs and Logic Programming
Moore's autoepistemic logic AEL proved to be a very successful approach to formalizing non-monotonic reasoning and logic programming. However, AEL also has some important drawbacks, e.g., quite \reasonable" theories are often inconsistent in AEL, it does not always lead to the expected, intended semantics and it cannot be eeectively computed even for very simple classes of theories. In this pap...
متن کاملNegative Introspection Is Mysterious
The paper provides a short argument that negative introspection cannot be algorithmic. This result with respect to a principle of belief fits to what we know about provability principles. Autoepistemic reasoning is reasoning the inferences of which depend on representing one’s own state of belief. A cognitive agent engaged in autoepistemic reasoning draws conclusion from introspective beliefs. ...
متن کاملVagueness and Introspection
Intransitivity and introspection. One central and debated aspect of the notion of inexact knowledge concerns the non-transitivity of the relation of indiscriminability and how it should be represented. On the epistemic account of vagueness put forward by Williamson, the intransitivity of the relation of indiscriminability is presented as the main source for vagueness ([5]: 237). In [4] and in t...
متن کامل